On Cui-Kano's Characterization Problem on Graph Factors
نویسندگان
چکیده
منابع مشابه
an investigation on influencing factors on tourists shopping attitude of iranian handmade carpet in isfahan
چکیده ندارد.
15 صفحه اولOn the graph isomorphism problem
We relate the graph isomorphism problem to the solvability of certain systems of linear equations and linear inequalities. The number of these equations and inequalities is related to the complexity of the graphs isomorphism and subgraph isomorphim problems. 2000 Mathematics Subject Classification: 03D15, 05C50, 05C60, 15A48, 15A51, 15A69, 90C05.
متن کاملOn the Hat Problem on a Graph
The topic of this paper is the hat problem in which each of n players is uniformly and independently fitted with a blue or red hat. Then everybody can try to guess simultaneously his own hat color by looking at the hat colors of the other players. The team wins if at least one player guesses his hat color correctly, and no one guesses his hat color wrong; otherwise the team loses. The aim is to...
متن کاملOn the graph turnpike problem
In the graph turnpike problem without distinctness, we are given a graph G = (V,E) with positive weights we > 0 on each edge e of G. The aim is to map each vertex v of G to a point f(v) in the real line so that d(f(u), f(v)) = |f(u)− f(v)| = we for each edge e = uv of G. In the graph turnpike problem with distinctness, we additionally require f(u) 6= f(v) for u 6= v. In this paper we prove resu...
متن کاملOn a problem in extremal graph theory
The number T*(n, k) is the least positive integer such that every graph with n = (*:I) + t vertices (t > 0) and at least T*(n, k) edges contains k mutually vertex-disjoint complete subgraphs S, , S, ,..., Sk where S, has ivertices, I < i Q k. Obviously T*(n, k) > T(n, k), the Turan number of edges for a Ki . It is shown that if n > gkk” then equality holds and that there is c :0 such that for (...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2013
ISSN: 0364-9024
DOI: 10.1002/jgt.21712